Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds
نویسندگان
چکیده
This paper investigates the power of Probabilistic Büchi Automata (PBA) when the threshold probability of acceptance is non-extremal, i.e., is a value strictly between 0 and 1. Many practical randomized algorithms are designed to work under non-extremal threshold probabilities and thus it is important to study power of PBAs for such cases. The paper presents a number of surprising expressiveness and decidability results for PBAs when the threshold probability is non-extremal. Some of these results sharply contrast with the results for extremal threshold probabilities. The paper also presents results for Hierarchical PBAs and for an interesting subclass of them
منابع مشابه
Recognizing ω-regular Languages with Probabilistic Automata
Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for ω-regular languages. Our main results are that our variant of probabilistic Büchi automata (PBA) is more expressive than non-deterministic ω-automata, but a certain subclass of PBA, called uniform PBA, has ...
متن کاملQuantitative Fair Simulation Gamest
Simulation is an attractive alternative for language inclusion for automata as it is an under-approximation of language inclusion, but usually has much lower complexity. For non-deterministic automata, while language inclusion is PSPACE-complete, simulation can be computed in polynomial time. Simulation has also been extended in two orthogonal directions, namely, (1) fair simulation, for simula...
متن کاملMechanizing the Minimization of Deterministic Generalized Büchi Automata
Deterministic Büchi automata (DBA) are useful to (probabilistic) model checking and synthesis. We survey techniques used to obtain and minimize DBAs for different classes of properties. We extend these techniques to support DBA that have generalized and transitionbased acceptance (DTGBA) as they can be even smaller. Our minimization technique—a reduction to a SAT problem—synthesizes a DTGBA equ...
متن کاملBüchi VASS recognise w-languages that are Sigma^1_1 - complete
This short note exhibits an example of a Σ1-complete language that can be recognised by a one blind counter Büchi automaton (or equivalently a Büchi VASS with only one place). In this work we study the topological complexity of ω-languages recognised by vector addition systems with states equipped with Büchi acceptance condition (Büchi VASS). This model corresponds, from the automata theoretic ...
متن کاملThe Decidability Frontier for Probabilistic Automata on Infinite Words
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi, and limitaverage conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs for probabilistic finite automata and present a complete characterization of the decidability and undecidability frontier of the quantitative ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011